Program optimization carving for GPU computing

نویسندگان

  • Shane Ryoo
  • Christopher I. Rodrigues
  • Sam S. Stone
  • John A. Stratton
  • Sain-Zee Ueng
  • Sara S. Baghsorkhi
  • Wen-mei W. Hwu
چکیده

Contemporary many-core processors such as the GeForce 8800 GTX enable application developers to utilize various levels of parallelism to enhance the performance of their applications. However, iterative optimization for such a system may lead to a local performance maximum, due to the complexity of the system.We propose programoptimization carving, a technique that beginswith a complete optimization space and prunes it down to a set of configurations that is likely to contain the global maximum. The remaining configurations can then be evaluated to determine the one with the best performance. The technique can reduce the number of configurations to be evaluated by as much as 98% and is successful at finding a near-best configuration. For some applications, we show that this approach is significantly superior to random sampling of the search space. © 2008 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of a single seam removal using a GPU

In this paper we consider the problem of implementing and optimizing the Seam Carving algorithm on graphics processing units. Seam Carving is a content-aware image resizing method proposed by Avidan and Shamir. In order to use their proposed method in real-time application, a pre-processing step is needed. While some other papers propose real-time resizing by changing the original Seam Carving ...

متن کامل

A Cross-Input Adaptive Framework for GPU Programs Optimization

Recent years have seen a trend in using graphic processing units (GPU) as accelerators for generalpurpose computing. The inexpensive, single-chip, massively parallel architecture of GPU has evidentially brought factors of speedup to many numerical applications. However, the development of a high-quality GPU application is challenging, thanks to the large optimization space and complex unpredict...

متن کامل

Design and Storage Optimization of GPU-based Parallel Program of Image Registration for Remote Sensing

Image registration is a crucial step of many remote sensing related applications. As the scale of data and complexity of algorithm keep growing, image registration faces great challenges of its processing speed. In recent years, the computing capacity of GPU improves greatly. Taking the benefits of using GPU to solve general propose problem, we research on GPU-based remote sensing image registr...

متن کامل

Solution Level Parallelization of Local Search Metaheuristic Algorithm on GPU

Local search metaheuristic algorithms are proven & powerful combinatorial optimization strategies to tackle hard problems like traveling salesman problem. These algorithms explore & evaluate neighbors of a single solution. Time Consuming LSM algorithms can be improved by parallelizing exploration & evaluation of neighbors of a solution. GPU architecture is suitable for algorithms of single prog...

متن کامل

Solving the Flexible Job Shop Problem on Multi-GPU

We propose the new framework of the distributed tabu search metaheuristic designed to be executed using a multi-GPU cluster, i.e. cluster of nodes equipped with GPU computing units. We propose a hybrid single-walk parallelization of the tabu search, where hybridization consists in examining a number of solutions from a neighborhood concurrently by several GPUs (multi-GPU). The methodology is de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 2008